A Type System for Lock-Free Processes
نویسندگان
چکیده
منابع مشابه
A Type System for Lock-Free Processes
Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ ⊢ P as “Γ is an abstraction of a concrete process P .” (The relation “⊢” corresponds to a pair of abstraction/co...
متن کاملYet Another Type System for Lock-Free Processes
A network of processes is lock free if every message produced in it is eventually consumed and if every process waiting for a message eventually receives one. We study a type system guaranteeing that well-typed process networks are lock free. Despite its minimality, our type system subsumes existing type-based approaches for lock freedom. In particular, we show that interactions whose lock free...
متن کاملA Type System for Lock-Free Processes1
Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ P as “Γ is an abstraction of a concrete process P .” (The relation “ ” corresponds to a pair of abstraction/conc...
متن کاملA New Type System for Deadlock-Free Processes
We extend a previous type system for the π-calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorithm or were not strong enough to ensure deadlock-freedom of processes using recursion. Although the extension is fairly simple, the new type system admits type inference and is much more expressive than the previous t...
متن کاملA simple proof system for lock-free concurrency
The use of locking is the classical approach to prevent interference in concurrent access to shared data structures. Using locks it is not difficult to ensure data consistency (a safety property) and deadlockfreedom (a liveness property). Many sophisticated implementation and reasoning techniques for lockbased concurrent programming have been developed over some decades. Lock-based synchronizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2002.3171